Extremality of submodular functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Submodular Functions

Submodular functions and related polyhedra play an increasing role in combinatorial optimization. The present survey-type paper is intended to provide a brief account of this theory along with several applications in graph theory and combinatorial optimization.

متن کامل

A Proportionally Submodular Functions

Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions, which we call proportionally submodular functions. Our extension includes some (mildly) supermodular functions. We show that several natural functions belong to ...

متن کامل

Approximating submodular functions everywhere

Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular functions can be solved using only polynomially many queries to the oracle, e.g., exact minimization or approximate maximization. In this paper, we consider the problem of approxi...

متن کامل

Submodular partition functions

Adapting the method introduced in Graph Minors X, we propose a new proof of the duality between the bramble-number of a graph and its tree-width. Our approach is Preprint submitted to Elsevier 23 December 2008 based on a new definition of submodularity on partition functions which naturally extends the usual one on set functions. The proof does not rely on Menger’s theorem, and thus greatly gen...

متن کامل

Deep Submodular Functions

We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call deep submodular functions or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share many of the properties and advantages of deep ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2000

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(99)00196-6